The Choice Construct in the Soufflé Language

Datalog has become a popular implementation language for solving large-scale, real world problems, including bug finders, network analysis tools, and disassemblers. These applications express complex behaviour with hundreds of relations rules that often require non-deterministic choice tuples in to worklist algorithms.This work is an experience report describes the construct engine Soufflé. With we can algorithms such as spanning trees few lines code. We highlight differences between rule-based described prior work, relation-based introduced by this work. show enables certain be computed up 10k\(\times \) faster than having no construct.